The continuous iteration of real functions
نویسندگان
چکیده
منابع مشابه
The ring of real-continuous functions on a topoframe
A topoframe, denoted by $L_{ tau}$, is a pair $(L, tau)$ consisting of a frame $L$ and a subframe $ tau $ all of whose elements are complementary elements in $L$. In this paper, we define and study the notions of a $tau $-real-continuous function on a frame $L$ and the set of real continuous functions $mathcal{R}L_tau $ as an $f$-ring. We show that $mathcal{R}L_{ tau}$ is actually a generali...
متن کاملPointfree topology version of image of real-valued continuous functions
Let $ { mathcal{R}} L$ be the ring of real-valued continuous functions on a frame $L$ as the pointfree version of $C(X)$, the ring of all real-valued continuous functions on a topological space $X$. Since $C_c(X)$ is the largest subring of $C(X)$ whose elements have countable image, this motivates us to present the pointfree version of $C_c(X).$The main aim of this paper is to present t...
متن کاملINTERSECTION OF ESSENTIAL IDEALS IN THE RING OF REAL-VALUED CONTINUOUS FUNCTIONS ON A FRAME
A frame $L$ is called {it coz-dense} if $Sigma_{coz(alpha)}=emptyset$ implies $alpha=mathbf 0$. Let $mathcal RL$ be the ring of real-valued continuous functions on a coz-dense and completely regular frame $L$. We present a description of the socle of the ring $mathcal RL$ based on minimal ideals of $mathcal RL$ and zero sets in pointfree topology. We show that socle of $mathcal RL$ is an essent...
متن کاملthe ring of real-continuous functions on a topoframe
a topoframe, denoted by $l_{ tau}$, is a pair $(l, tau)$ consisting of a frame $l$ and a subframe $ tau $ all of whose elements are complementary elements in$l$. in this paper, we define and study the notions of a$tau $-real-continuous function on a frame $l$ and the set of realcontinuous functions $mathcal{r}l_tau $ as an $f$-ring.we show that $mathcal{r}l_{ tau}$is actually a generalization ...
متن کاملContinuous Turing Machine: Real Function Computability and Iteration Issues
Contemporary computer theory is governed by the discretization of continuous problems. Classical Turing machines (TMs) are originally built to solve computation and computability problems, which main feature is discreteness. However, even some simple numerical calculations problems, e.g., iterations in Rn, generate difficulties to be described or solved by constructing a TM. This paper explores...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1936
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1936-06311-1